搜索资源列表
用分枝定界法求解TSP
- 分支定界法可以求解小规模的TSP问题,这个例子是用vc编写的-branch and bound method can solve small-scale TSP, this example was prepared by the vc
货郎担分枝限界图形演示
- 货郎担分枝限界图形演示 问题描述:某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-traveling salesman Branch and Bound graphic demonstration Problem descr iption : A salesman to a number of cities to sell commodities, the known distance
01背包问题
- 采用分枝限界法解决0/1背包问题! 本人上机实习作业,通过老师验收,合格! 针对部分上机实习的同学可以来下~-used Branch and Bound France 0 / 1 knapsack problem! I practice on the machine operations, acceptance by the teachers, qualified! In view of the attachment on the machine for students to the
园排列问题
- 分支限界法解圆排列问题，是一个算法设计与分析课程的作业-branch and bound method for solving problems with a round of one algorithm design and analysis of the operational programs
优先队列式分支限界法园排列问题
- 优先队列式分支限界法园排列问题，是一个作业，算法设计与分析-priority queue-branch and bound with France Park, is an operation, algorithm design and analysis
BoundAndBranch
- 我的算法作业，求一个在总花费小于1500的条件下从源结点到目的结点的最短路径，源代码Tree.cpp（C++语言编写，VC++6.0 IDE下调试通过），利用的是分支定界算法。可执行文件Tree.exe说明在ReadMeFirst请按照说明使用。-algorithm operations, for a total cost of less than 1,500 from the source node to node purpose of the shortest path, Tree.cpp
MATLAB 解整数规划 （分支定界)
- matlab解用分支定界法解整数规划的程序。请大家参考-solutions using Matlab branch and bound method for integer programming procedures. Please refer
BNB20
- 利用matlab进行分支定界的算法-using Matlab for branch-and-bound algorithm
matlog
- 物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP) Networks: Sho
intprog
- 采用分支定界算法，主程序为intopt，使用与linprog类似-used branch-and-bound algorithm for the main program intopt, use and similar linprog
Branchboundalgorithmtosolvthetravellingsalesmanpro
- 货郎担限界算法.c，货郎担分枝限界图形演示.c-traveling salesman Bound algorithm. C, traveling salesman Branch and Bound graphic demonstration. C
lqx10004
- 最小重量机器设计问题 设某一机器由n个部件组成，每一种部件都可以从m个不同的供应商处购得。设w(i,j)是从供应商j处购得的部件i的重量,C(i,j)是相应的价格。 设计一个优先列式分支限界法，给出总价格不超过c的最小重量机器设计。-minimum weight machines based design of a machine n components, each component can be 000 m from different vendors purchased. L
mathmodel
- 这是一个好的建模学习资料,赶快下载吧, 数学建模十大算法 ( 包含:蒙特卡罗算法、数据拟合、参数估计、 插值等数据处理算法、线性规划、整数规划、多元规划、二次规划等规划类问题、 图论算法、动态规划、回溯搜索、分治算法、分支定界等计算机算法、 最优化理论的三大非经典算法：模拟退火法、神经网络、遗传算法、 网格算法和穷举法、一些连续离散化方法、数值分析算法、图象处理算法）-This a good model to study the information, downloa
HuoLangDanProblem
- 分支限界法实现货郎担问题，开发工具eclipse-branch and bound Method traveling salesman problem, development tools eclipse
01package
- 背包问题优先队列分枝限界算法 所谓的背包问题，可以描述如下：一个小偷打劫一个保险箱，发现柜子里有N类不同大小与价值的物品，但小偷只有一个容积为M的背包来装东西，背包问题就是要找出一个小偷选择所偷物品的组合，以使偷走的物品总价值最大。这个问题的求解有很多种方法，本程序使用分枝限界法求解。-knapsack problem Branch and Bound priority queue algorithm called knapsack problem can be described as f
tsp.c
- 求解货郎担问题的分枝限界算法,程序中有较为详细的注释-solving the traveling salesman problem Branch and Bound algorithm, procedures are more detailed Notes
The-algorithm-analysis-and-design
- 研究生上课所用的算法分析与设计相关文档PPT，分八个章节对算法进行详细介绍： 第1章 算法引论 第2章 递归与分治策略 第3章 动态规划 第4章 贪心算法 第5章 回溯法 第6章 分支限界法 第7章 概率算法 第8章 NP完全性理论 -Graduate classes used in algorithm analysis and design documents the PPT is divided into eight chapters on the alg
branch
- 关于基因序列上的比对问题 运用的方法是分支定界法 同时有贪婪算法作以比较-On the sequence alignment problem on the use of branch and bound method is a greedy algorithm for the same time to compare
and
- 外观模拟分支定界 分支定界 分支定界,可以很好-Branch and bound appearance simulation branch and bound branch and bound, branch and bound can be very good
bxcnch-branch
- Branch and bound appearance simulation branch and bound branch and bound, branch and bound can be very good